Minimizing Regret when Dissolving a Partnership

نویسندگان

  • Stergios Athanassoglou
  • Steven J. Brams
  • Jay Sethuraman
چکیده

We study the problem of dissolving an equal-entitlement partnership when the objective is to minimize maximum regret. We initially focus on the family of linear-pricing mechanisms and derive regret-optimizing strategies. We also demonstrate that there exist linear-pricing mechanisms satisfying ex-post efficiency. Next, we analyze a binary-search mechanism which is ex-post individually rational. We discuss connections with the standard Bayesian-Nash framework for both linear and binary-search mechanisms. On a more general level, we show that if entitlements are unequal, ex-post efficiency and ex-post individual rationality impose significant restrictions on permissible mechanisms. In particular, they rule out both linear and binary-search mechanisms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimizing Wide Range Regret with Time Selection Functions

We consider the problem of minimizing regret with respect to a given set S of pairs of time selection functions and modifications rules. We give an online algorithm that has O( √ T log |S|) regret with respect to S when the algorithm is run for T time steps and there are N actions allowed. This improves the upper bound of O( √ TN log(|I||F|)) given by Blum and Mansour [BM07a] for the case when ...

متن کامل

Minimizing Regret in Dynamic Decision Problems

The menu-dependent nature of regret-minimization creates subtleties in applying regret-minimization to dynamic decision problems. Firstly, it is not clear whether forgone opportunities should be included in the menu. We explain commonly observed behavioral patterns as minimizing regret when forgone opportunities are present, and also show how the treatment of forgone opportunities affects behav...

متن کامل

Minimizing regret : the general case . ¤ Aldo

In repeated games with di®erential information on one side, the labelling \general case" refers to games in which the action of the informed player is not known to the uninformed, who can only observe a signal which is the random outcome of his and his opponent's action. Here we consider the problem of minimizing regret (in the sense ̄rst formulated by Hannan [8]) when the information available...

متن کامل

Minimizing Simple and Cumulative Regret in Monte-Carlo Tree Search

Regret minimization is important in both the Multi-Armed Bandit problem and Monte-Carlo Tree Search (MCTS). Recently, simple regret, i.e., the regret of not recommending the best action, has been proposed as an alternative to cumulative regret in MCTS, i.e., regret accumulated over time. Each type of regret is appropriate in different contexts. Although the majority of MCTS research applies the...

متن کامل

Computing optimal k-regret minimizing sets with top-k depth contours

Regret minimizing sets are a very recent approach to representing a dataset D with a small subset S of representative tuples. The set S is chosen such that executing any top-1 query on S rather than D is minimally perceptible to any user. To discover an optimal regret minimizing set of a predetermined cardinality is conjectured to be a hard problem. In this paper, we generalize the problem to t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008